Consensus Game Acceptors and Iterated Transductions

نویسنده

  • DIETMAR BERWANGER
چکیده

We study a game for recognising formal languages, in which two players with imperfect information need to coordinate on a common decision, given private input words correlated by a finite graph. The players have a joint objective to avoid an inadmissible decision, in spite of the uncertainty induced by the input. We show that the acceptor model based on consensus games characterises context-sensitive languages. Further, we describe the expressiveness of these games in terms of iterated synchronous transductions and identify a subclass that characterises context-free languages.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Iterating Inverse Binary Transducers

We study iterated transductions defined by a class of inverse transducers over the binary alphabet. The transduction semigroups of these automata turn out to be free Abelian groups and the orbits of finite words can be described as affine subspaces in a suitable geometry defined by the generators of these groups. We show that iterated transductions are rational for a subclass of our automata.

متن کامل

Iterating Invertible Binary Transducers

We study iterated transductions defined by a class of invertible transducers over the binary alphabet. The transduction semigroups of these automata turn out to be free Abelian groups and the orbits of finite words can be described as affine subspaces in a suitable geometry defined by the generators of these groups. We show that iterated transductions are rational for a subclass of our automata.

متن کامل

Iteration of rational transductions

The purpose of this paper is to show connections between iterated length preserving rational transductions and linear space computations Hence we study the smallest family of transductions containing length preserving rational transductions and closed under union composition and iteration We give several characterizations of this class using re stricted classes of length preserving rational tra...

متن کامل

Flocking in the depths of strategic iterated reasoning

Must it be the case that increasingly deep levels of strategic iterated reasoning by humans give increasingly close approximations of normative economic rationality? And if not, what might they do instead? We argue that human higher-level reasoning processes may support non-equilibrium, non-convergent "flocking" behavior. Flocking in the physical world is the sustained convergence of both the p...

متن کامل

The chaos game on a general iterated function system

The main theorem of this paper establishes conditions under which the ‘chaos game’ algorithm almost surely yields the attractor of an iterated function system. The theorem holds in a very general setting, even for non-contractive iterated function systems, and under weaker conditions on the random orbit of the chaos game than obtained previously.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016